An Inversion-Free Method for Finding Positive Definite Solution of a Rational Matrix Equation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Inversion-Free Method for Finding Positive Definite Solution of a Rational Matrix Equation

A new iterative scheme has been constructed for finding minimal solution of a rational matrix equation of the form X + A*X (-1) A = I. The new method is inversion-free per computing step. The convergence of the method has been studied and tested via numerical experiments.

متن کامل

A New Inversion-free Method for Hermitian Positive Definite Solution of Matrix Equation

An inversion-free iterative algorithm is presented for solving nonlinear matrix equation with a stepsize parameter t. The existence of the maximal solution is discussed in detail, and the method for finding it is proposed. Finally, two numerical examples are reported that show the efficiency of the method. Keywords—Inversion-free method, Hermitian positive definite

متن کامل

On positive definite solution of a nonlinear matrix equation

In this paper, an efficient iterative method is presented to solve a new nonlinear matrix equation * r X A X A I   with real matrices and r 1  . Some properties of the positive definite solutions for the nonlinear matrix equation are derived. Moreover, necessary and sufficient conditions for the existence of the positive definite solutions are derived. The error estimation of the iterative m...

متن کامل

Positive definite solution of the matrix equation X=Q+A^H(Iâ−ŠX-C)^(-Î ́)A

We consider the nonlinear matrix equation X = Q+A (I⊗X−C)A (0 < δ ≤ 1), where Q is an n× n positive definite matrix, C is an mn×mn positive semidefinite matrix, I is the m×m identity matrix, and A is an arbitrary mn×n matrix. We prove the existence and uniqueness of the solution which is contained in some subset of the positive definite matrices under the condition that I ⊗Q > C. Two bounds for...

متن کامل

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Scientific World Journal

سال: 2014

ISSN: 2356-6140,1537-744X

DOI: 10.1155/2014/560931